Reflecting Higher-Order Abstract Syntax in Nuprl
نویسندگان
چکیده
This document describes part of an effort to achieve in Nuprl a practical reflection of its expression syntax. This reflection is done at the granularity of the operators; in particular, each operator of the syntax is denoted by another operator of the same syntax. Further, the syntax has binding operators, and we organize reflection not around the concrete binding syntax, but instead, around the abstract higher-order syntax. We formulate and prove the correctness of a core rule for inferring well-formedness of instances of operator-denoting operators.
منابع مشابه
Implementing Reflection in Nuprl
Syntax : Syntax represented as data, similar to concrete syntax, except that irrelevant features are abstracted away. For this work, this is exactly like concrete syntax modulo alpha-equality. (Note that the “abstract” here is unrelated to functions, it is only to distinguished the represented syntax from the actual syntax.) Higher Order Abstract Syntax, HOAS : Similar to abstract syntax, excep...
متن کاملPrimitive Recursion for Higher-Order Abstract Syntax
Higher-order abstract syntax is a central representation technique in logical frameworks which maps variables of the object language into variables in the meta-language. It leads to concise encodings, but is incompatible with functions defined by primitive recursion or proofs by induction. In this paper we propose an extension of the simply-typed lambda-calculus with iteration and case construc...
متن کاملThe Nuprl Proof Development System , Version 5 Reference Manual and User ’ s Guide
terms provide a uniform data structure for representing almost any kind of formal content. They consist of an operator identifier, a list of parameters, and a list of bound subterms (see Chapter 5 for a detailed description). The abstract term syntax makes sure that no predefined structure is imposed on the contents of the library and makes parsing unnecessary. All visible structure and notatio...
متن کاملCombining Automated Theorem Provers and Computer Algebra Systems for Generating Formal Proofs of Complexity Bounds
Over the past few years, the traditional separation between automated theorem provers and computer algebra systems has slowly been eroded as both sides venture into foreign territory. But despite recent progress, theorem provers still have difficulties with basic arithmetic while computer algebra system inherently produce “untrusted” results that are not easily verified. We were able to combine...
متن کامل[hal-00772522, v1] Relating nominal and higher-order abstract syntax specifications
Nominal abstract syntax and higher-order abstract syntax provide a means for describing binding structure which is higher-level than traditional techniques. These approaches have spawned two different communities which have developed along similar lines but with subtle differences that make them difficult to relate. The nominal abstract syntax community has devices like names, freshness, name-a...
متن کامل